Schedulability and Performance Analysis of the Similarity Stack Protocol

نویسندگان

  • Tei-Wei Kuo
  • Aloysius K. Mok
چکیده

We propose a class of real-time data access protocols called SSP (Similarity Stack Protocol). The correctness of SSP schedules is justified by the concept of similarity which allows different but sufficiently timely data to be used in a computation without adversely affecting the outcome. SSP schedules are deadlock-free, subject to limited blocking, and do not use locks. We give a schedulability bound for SSP and also report simulation results which show that SSP is especially useful for scheduling real-time data access on multiprocessor systems. Finally, we present a variation of SSP which can be implemented in an autonomous fashion in the sense that scheduling decisions can be made with local information only.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Schedulability Analysis of an Event-Based Real-Time Protocol Framework

This paper presents a method to analyze the timing behavior of an event-based real-time protocol composition framework. The framework, called RT-Appia, allows the development and implementation of configurable real-time protocol stacks. The method performs the schedulability analysis for events flowing in a real-time channel and is based on the holistic theory for distributed real-time systems....

متن کامل

Schedulability analysis of synchronization protocols based on overrun without payback for hierarchical scheduling frameworks revisited

In this paper, we revisit global as well as local schedulability analysis of synchronization protocols based on the stack resource protocol (SRP) and overrun without payback for hierarchical scheduling frameworks based on fixed-priority pre-emptive scheduling (FPPS). We show that both the existing global and local schedulability analysis are pessimistic, present improved analysis, and illustrat...

متن کامل

Holistic1 Schedulability Analysis for Distributed Hard Real-time Systems

This report extends the current analysis associated with static priority pre-emptive based scheduling to address the wider problem of analysing schedulability of a distributed hard real-time system; in particular it derives analysis for a distributed system where tasks with arbitrary deadlines communicate by message passing and shared data areas. A simple TDMA protocol is assumed, and analysis ...

متن کامل

Holistic schedulability analysis for distributed hard real-time systems

This report extends the current analysis associated with static priority pre-emptive based scheduling to address the wider problem of analysing schedulability of a distributed hard real-time system; in particular it derives analysis for a distributed system where tasks with arbitrary deadlines communicate by message passing and shared data areas. A simple TDMA protocol is assumed, and analysis ...

متن کامل

A Stack-Based Resource Allocation Policy for Realtime Processes

The Stack Resource Policy (SRP) is a resource allocation policy which permits processes with different priorities to share a single runtime stack. It is a refinement of the Priority Ceiling Protocol (PCP) of Sha, Rajkumar and Lehoczky, which strictly bounds priority inversion and permits simple schedulability tests. With or without stack sharing, the SRP offers improvements over the PCP, by: (1...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2003